Uniform tree approximation by global optimization techniques
نویسندگان
چکیده
منابع مشابه
Uniform Approximation by Elementary Operators
On a separable C-algebra A every (completely) bounded map which preserves closed two sided ideals can be approximated uniformly by elementary operators if and only if A is a finite direct sum of C-algebras of continuous sections vanishing at ∞ of locally trivial C-bundles of finite type.
متن کاملPredicting Twist Condition by Bayesian Classification and Decision Tree Techniques
Railway infrastructures are among the most important national assets of countries. Most of the annual budget of infrastructure managers are spent on repairing, improving and maintaining railways. The best repair method should consider all economic and technical aspects of the problem. In recent years, data analysis of maintenance records has contributed significantly for minimizing the costs. B...
متن کاملOn uniform approximation by splines
for 0 ≤ r ≤ k − 1. In particular, dist (f, S π) = O(|π| ) for f ∈ C(I), or, more generally, for f ∈ C(I), such, that f (k−1) satisfies a Lipschitz condition, a result proved earlier by different means [2]. These results are shown to be true even if I is permitted to become infinite and some of the knots are permitted to coalesce. The argument is based on a “local” interpolation scheme Pπ by spl...
متن کاملUniform approximation by (quantum) polynomials
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson’s Theorem, which gives a nearly-optimal quantitative version of Weierstrass’s Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectively on quantum counting and on quantum phase estimation.
متن کاملApproximation Techniques for Stochastic Combinatorial Optimization Problems
The focus of this thesis is on the design and analysis of algorithms for basic problems in Stochastic Optimization, speciVcally a class of fundamental combinatorial optimization problems where there is some form of uncertainty in the input. Since many interesting optimization problems are computationally intractable (NP-Hard), we resort to designing approximation algorithms which provably outpu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computing and Visualization in Science
سال: 2009
ISSN: 1432-9360,1433-0369
DOI: 10.1007/s00791-009-0126-4